The Differences of Parallel Efficiency between the Two Models of Parallel Genetic Algorithms on PC Cluster Systems
نویسندگان
چکیده
In this paper, the characteristics of the typical two models of parallel genetic algorithms are compared. Those models are the coarse grained model and the micro grained model. Especially, the parallel efficiency and the total calculation time on PC clusters that are build with commodity hardware are examined. The characteristics are examined through the numerical examples. There are two major characteristics in the coarse grained model. One of them is the network cost is very small. The other is the fact that the necessary number of iteration is smaller than that of the model of the micro grained model. On the other hand, in the micro grained model, the ideal parallel efficiency cannot be reached to 100 %. Therefore, it is concluded the coarse grained model is suitable for PC cluster systems.
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملTwo Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملReliability Modelling of the Redundancy Allocation Problem in the Series-parallel Systems and Determining the System Optimal Parameters
Considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. In this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کامل